The Availability of Complemental k-Coteries
نویسندگان
چکیده
k-Coterie is a graceful concept to solve the distributed k-mutual exclusion problem. The k-mutual exclusion algorithm adopting k-coteries could provide the fault-tolerant capability. The complementalness and the availability are two important metrics to measure the fault-tolerant capability of a k-coterie. Since those two metrics are defined under two different failure assumptions, for a given k-coterie, two independent works to measure those two metrics are necessary. In this paper, we derive the characteristics of the complemental k-coterie on its availability. With the characteristic, verifying the complementalness of a k-coterie and evaluating its availability could be combined together to reduce the redundant works on measuring the fault-tolerant capability of the k-coterie.
منابع مشابه
A Coterie Join Operation and Tree Structured k-Coteries
ÐThe coterie join operation proposed by Neilsen and Mizuno produces, from a k-coterie and a coterie, a new k-coterie. For the coterie join operation, this paper first shows 1) a necessary and sufficient condition to produce a nondominated k-coterie (more accurately, a nondominated k-semicoterie satisfying Nonintersection Property) and 2) a sufficient condition to produce a k-coterie with higher...
متن کاملObtaining Optimal Coteries that Maximize Availability in General Topology Networks
We discuss availability optimization of quorum-based mutual exclusion mechanisms in unreliable networks. The availability of such a mechanism depends critically on the coterie (a set of node groups called quorums) that the mechanism adopts. Previously, an integerprogramming approach was proposed for obtaining optimal coteries that maximize availability. However, this approach cannot be applied ...
متن کاملNondominated k-Coteries for Multiple Mutual Exclusion
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. In order to enter its critical section, a node must obtain permission from a quorum of nodes. A collection of quorums is called a coterie. The most resilient coteries are called nondominated coteries. Recently, k-coteries were proposed to be used in mutual exclusion algorithms that allow up to k entr...
متن کاملA Fault-Tolerant h-Out of-k Mutual Exclusion Algorithm Using Cohorts Coteries for Distributed Systems
In this paper, we propose a distributed algorithm for solving the h-out of-k mutual exclusion problem with the aid of a specific k-coterie cohorts coterie. The proposed algorithm is resilient to node and/or link failures, and has constant message cost in the best case. Furthermore, it is a candidate to achieve the highest availability among all the algorithms using k-coteries. We analyze the ...
متن کاملCoterie Availability in Sites
In this paper, we explore new failure models for multi-site systems, which are systems characterized by a collection of sites spread across a wide area network, each site formed by a set of computing nodes running processes. In particular, we introduce two failure models that allow sites to fail, and we use them to derive coteries. We argue that these coteries have better availability than quor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. J.
دوره 51 شماره
صفحات -
تاریخ انتشار 2008